//
// Manta - Structural Variant and Indel Caller
// Copyright (c) 2013-2019 Illumina, Inc.
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program.  If not, see <http://www.gnu.org/licenses/>.
//
//

/// \file
/// \author Chris Saunders
///

#pragma once

#include "svgraph/EdgeInfo.hpp"
#include "svgraph/SVLocusSet.hpp"

inline bool isBidirectionalEdge(const SVLocusSet& cset, const EdgeInfo& edge)
{
  const unsigned minEdgeCount(cset.getMinMergeEdgeCount());

  const SVLocus& locus(cset.getLocus(edge.locusIndex));

  return (
      (locus.getEdge(edge.nodeIndex1, edge.nodeIndex2).getCount() >= minEdgeCount) &&
      (locus.getEdge(edge.nodeIndex2, edge.nodeIndex1).getCount() >= minEdgeCount));
}

/// determine if this is a self-edge of a node with no other (bidirectional-pass) edges:
bool testIsolatedEdge(const SVLocusSet& cset, const EdgeInfo& edge);
